/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: lenovo
 * Date: 2022-09-12
 * Time: 17:42
 */
public class Test {
    public static void main(String[] args) {
        BinarySearchTree tree = new BinarySearchTree();
        int[] array = {40,80,20,50,90,45,60};
        for (int i = 0; i < array.length; i++) {
            tree.insert(array[i]);
        }
        System.out.println(tree);
        tree.inorder(tree.search(array[0]));
//        System.out.println(tree.serach(10));
//        System.out.println(tree.search(20));
//        tree.delete(40);
//        System.out.println();
    }
}
